Configuration management via constraint programming
نویسندگان
چکیده
1 Abstract As the complexity of computer systems has increased, the task of managing those systems has grown to the point where the assistance of the computer itself is required. The diversity of management tasks has, in turn, lead to a diversity of software. In Unix, for example, make(1), rcs(1) and cron(8) each address this issue. Distributed systems expand the realm of connguration management through emphasis on issues such as communication, dynamic reconnguration, and consistency between information maintained at diierent sites. The Raven Connguration Management System (RCMS) provides a uniform means for performing many of these tasks. Connguration information is expressed as constraints in rst order predicate logic. The constraints indicate acceptable states of the system. When the system enters a prohibited state, an expert system generates a series of commands to correct the situation. This paper ooers a preliminary overview of the RCMS, including a sample application and a description of noteworthy implementation issues. 2 Introduction Connguration management is not something that just happens to other people. It affects the casual user of a personal computer and the the system manager responsible for maintaining a diverse collection of hardware interconnected via networks and internets.
منابع مشابه
Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java
Programming languages and techniques based on logic and constraints, such as the Constraint Handling Rules (CHR), can support many common programming tasks that can be expressed in the form of a search for feasible or optimal solutions. Developing new constraint solvers using CHR is especially interesting in configuration management for large scale, distributed and dynamic cloud applications, w...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملManufacturing Cell Configuration Considering Worker Interest Concept Applying a Bi-Objective Programming Approach
Generally, human resources play an important role in manufacturing systems as they can affect the work environment. One of the most important factors affecting the human resources is being an interactional interest among the workers in the workshops. If the workers in a manufacturing cell have the highest surface of the interactional interest level, it causes a significant raise in coordination...
متن کاملIncorporating Return on Inventory Investment into Joint Lot-Sizing and Price Discriminating Decisions: A Fuzzy Chance Constraint Programming Model
Coordination of market decisions with other aspects of operations management such as production and inventory decisions has long been a meticulous research issue in supply chain management. Generally, changes to the original lot-sizing policy stimulated by market prices may impose remarkable deviation revenue throughout the supply and demand chain system. This paper examines how to set the chan...
متن کاملUnifying Product and Software Configuration
Research on computer-supported configuration of customizable products and services is currently carried out in two main communities: one community is mainly focused on the configuration of hardware artifacts, the other one is interested in configurable software systems and software product lines. Despite the significant overlap in research interests, the fields have mainly evolved in isolation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992